<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW">
    <link rel="icon" href="../images/logo/logo.png" type="image/x-icon">
    <link rel="shortcut icon" href="../images/logo/logo.png"
          type="image/x-icon">
    <title>浏阳德塔软件开发有限公司 女娲计划</title>
</head>
<body style="Max-width: 700px; text-align:center; margin:auto;">
<div style="text-align:left; Max-width: 680px; margin-left:15px;">
    <a href="../">上一页</a>
    <br/>
    <br/>
    <br/>第七章 类人DNA与神经元基于催化算子映射编码方式
    <br/>The Initons Catalytic Reflection Between Humanoid DNA and Nero
    Cell
    <br/>类人 DNA 与 神经元基于催化算子映射编码方式
    <br/>Yaoguang Luo, Rongwu Luo
    <br/>罗瑶光, 罗荣武
    <br/>Keywords
    <br/>VPCS, AOPM, IDUC, Nero, Artificial, Decoder, Medical, Paralling,
    Computing,
    <br/>Humanoid, ETL, Parser, Data Mining
    <br/>关键词
    <br/>VPCS 架构 AOPM 逻辑 IDUC 编码 神经元 人工 解码 医学 并行计算 类人仿生 ETL
    数据挖掘 爬取
    <br/>4. 2 Deta Finding initions development, 德塔催化计算算子单元寻找发展
    <br/>
    The first demonstration process is Deta word segmentation. In
    2019, I continued to refine, optimize and refine the word segmentation,
    and found an exciting argument. My word segmentation function was
    continuously split rationally. Finally, a pile of simple combination
    application fragments of addition, deletion and modification were
    displayed by IOAON. For the most powerful argument, when I was
    processing nouns in word segmentation, the final function was formed.
    Memory takes out 4 words, compares 4 words proverbs, does not? then
    compare 3 words, does not? then compare 2 words, and does not? then
    split into single words. This process is summarized in one sentence as
    a combined decision-making process of adding, deleting, modifying and
    checking memory data according to John von Neumann's time flow form.
    <br/>
    第一个论证过程是德塔分词, 2019 年我不断的进行分词的细化, 优化, 反复的提炼,
    发现了一些振奋人心的论点, 我的分词函数进行不断的有理拆分, 最后是一堆 结构比较简单的
    增删改查的组合应用片段 通过 IOAON 的方式 来展示. 举个最有力的论证 我在分词处理名词
    的时候, 最后函数形成了, 内存拿出 4 字词, 比较 4 字谚语, 没有比较 3 字词, 没有比较
    2 字词, 没有拆分成单字, 这个过程 一句话概括就是按照 冯, 若依曼 的时间流水形式,
    对内存数据 的 增, 删, 改, 查 的组合决策过程.
    <br/>
    When I think about this, my eyes a little bit shine. IDUC is not only the
    operation mode of database, but also the operation mode of memory data,
    and it is absolutely focused continuously!!! Assuming that IDUC is
    effective for all data operation modes, assuming it is successful, if
    it is coded, it is a very strict coding mode of data DNA. I found it! I
    began to refine my sorting algorithm, word segmentation algorithm, ETL,
    YangLiaoJing, etc., and found one thing in common. All my works were
    refined to the rational function level that I could understand, which
    were small fragments of the combined decision-making process of adding,
    deleting, modifying and checking linear, multidimensional, database and
    memory data. These fragments can be coded effectively.
    <br/>
    我思考到这, 眼前一亮, IDUC 不仅是数据库的操作方式, 也是内存数据的操作方式,
    持续的绝对专注!!! 假设 IDUC 这个组合决策过程 对所有数据的操作方式 都有效, 假设成功,
    如果编码, 那这就是数据 DNA 的一种非常严谨的编码方式. 我找到了! 我开始细化我的排序算法,
    分词算法, ETL, 养疗经, 等作品, 发现一个共同点, 我的所有作品细化到我能理解的有理函数级别,
    都是对线性, 多维, 数据库, 内存数据 的 增, 删, 改, 查 的组合决策过程的小片段. 这些
    片段都能进行有效的编码.
    <br/>
    //为什么我数百万字文章和笔记还有中英文各种初中语法错别字，但是阅读起来会如此调理通畅还顺口。。
    //这一定是我当年的问题，我要改正。改正第一点，浏阳本地特别是身边人，永不主动靠近。
</div>
</body>